MozartV1, PascalFrancis, Corpus, bibRecord, 000200

Parallel agent-based simulation on a cluster of workstations

Identifieur interne : 000200 ( PascalFrancis/Corpus ); précédent : 000199; suivant : 000201

Parallel agent-based simulation on a cluster of workstations

Auteurs : Konstantin Popov ; Mahmoud Rafea ; Fredrik Holmgren ; Per Brand ; Vladimir Vlassov ; Self Haridi

Source :

Parallel processing letters [ 0129-6264 ] ; 2003.

RBID : Pascal:04-0108150

Descripteurs français

Pascal (Inist)
- Système réparti, Parallélisme, Système multiagent, Simulation, Extensibilité, Réseau web, Comportement utilisateur, Réseau social.

English descriptors

KwdEn :
- Distributed system, Multiagent system, Parallelism, Scalability, Simulation, Social network, User behavior, World wide web.

Abstract

We discuss a parallel implementation of an agent-based simulation. Our approach allows to adapt a sequential simulator for large-scale simulation on a cluster of workstations. We target discrete-time simulation models that capture the behavior of Web users and Web sites. Web users are connected with each other in a graph resembling the social network. Web sites are also connected in a similar graph. Users are stateful entities. At each time step, they exhibit certain behaviour such as visiting bookmarked sites, exchanging information about Web sites in the "word-of-mouth" style, and updating bookmarks. The real-world phenomena of emerged aggregated behavior of the Internet population is studied. The system distributes data among workstations, which allows large-scale simulations infeasible on a stand-alone computer. The model properties cause traffic between workstations proportional to partition sizes. Network latency is hidden by concurrent simulation of multiple users. The system is implemented in Mozart that provides multithreading, dataflow variables, component-based software development, and network-transparency. Currently we can simulate up to 10⁶ Web users on 10⁴ Web sites using a cluster of 16 computers, which takes few seconds per simulation step, and for a problem of the same size, parallel simulation offers speedups between 11 and 14.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0129-6264`
A03		`1`		`@0 Parallel process. lett.`
A05				`@2 13`
A06				`@2 4`
A08	`01`	`1`	`ENG`	`@1 Parallel agent-based simulation on a cluster of workstations`
A11	`01`	`1`		`@1 POPOV (Konstantin)`
A11	`02`	`1`		`@1 RAFEA (Mahmoud)`
A11	`03`	`1`		`@1 HOLMGREN (Fredrik)`
A11	`04`	`1`		`@1 BRAND (Per)`
A11	`05`	`1`		`@1 VLASSOV (Vladimir)`
A11	`06`	`1`		`@1 HARIDI (Self)`
A14	`01`			`@1 Distributed Systems Laboratory, SICS, Isafjordsgatan 22 Box 1263 @2 16429 Kista @3 SWE @Z 1 aut. @Z 2 aut. @Z 3 aut. @Z 4 aut.`
A14	`02`			`@1 Department of Microelectronics and Information Technology, KTH, Isafjordsgatan 22 Electrum 229 @2 16440 Kista @3 SWE @Z 5 aut. @Z 6 aut.`
A20				`@1 629-641`
A21				`@1 2003`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 22960 @5 354000116425020100`
A44				`@0 0000 @1 © 2004 INIST-CNRS. All rights reserved.`
A45				`@0 35 ref.`
A47	`01`	`1`		`@0 04-0108150`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Parallel processing letters`
A66	`01`			`@0 SGP`
C01	`01`		`ENG`	@0 We discuss a parallel implementation of an agent-based simulation. Our approach allows to adapt a sequential simulator for large-scale simulation on a cluster of workstations. We target discrete-time simulation models that capture the behavior of Web users and Web sites. Web users are connected with each other in a graph resembling the social network. Web sites are also connected in a similar graph. Users are stateful entities. At each time step, they exhibit certain behaviour such as visiting bookmarked sites, exchanging information about Web sites in the "word-of-mouth" style, and updating bookmarks. The real-world phenomena of emerged aggregated behavior of the Internet population is studied. The system distributes data among workstations, which allows large-scale simulations infeasible on a stand-alone computer. The model properties cause traffic between workstations proportional to partition sizes. Network latency is hidden by concurrent simulation of multiple users. The system is implemented in Mozart that provides multithreading, dataflow variables, component-based software development, and network-transparency. Currently we can simulate up to 10⁶ Web users on 10⁴ Web sites using a cluster of 16 computers, which takes few seconds per simulation step, and for a problem of the same size, parallel simulation offers speedups between 11 and 14.
C02	`01`	`X`		`@0 001D02B04`
C03	`01`	`X`	`FRE`	`@0 Système réparti @5 03`
C03	`01`	`X`	`ENG`	`@0 Distributed system @5 03`
C03	`01`	`X`	`SPA`	`@0 Sistema repartido @5 03`
C03	`02`	`X`	`FRE`	`@0 Parallélisme @5 04`
C03	`02`	`X`	`ENG`	`@0 Parallelism @5 04`
C03	`02`	`X`	`SPA`	`@0 Paralelismo @5 04`
C03	`03`	`X`	`FRE`	`@0 Système multiagent @5 05`
C03	`03`	`X`	`ENG`	`@0 Multiagent system @5 05`
C03	`03`	`X`	`SPA`	`@0 Sistema multiagente @5 05`
C03	`04`	`X`	`FRE`	`@0 Simulation @5 06`
C03	`04`	`X`	`ENG`	`@0 Simulation @5 06`
C03	`04`	`X`	`SPA`	`@0 Simulación @5 06`
C03	`05`	`X`	`FRE`	`@0 Extensibilité @5 09`
C03	`05`	`X`	`ENG`	`@0 Scalability @5 09`
C03	`05`	`X`	`SPA`	`@0 Estensibilidad @5 09`
C03	`06`	`X`	`FRE`	`@0 Réseau web @5 13`
C03	`06`	`X`	`ENG`	`@0 World wide web @5 13`
C03	`06`	`X`	`SPA`	`@0 Red WWW @5 13`
C03	`07`	`X`	`FRE`	`@0 Comportement utilisateur @5 14`
C03	`07`	`X`	`ENG`	`@0 User behavior @5 14`
C03	`07`	`X`	`SPA`	`@0 Comportamiento usuario @5 14`
C03	`08`	`X`	`FRE`	`@0 Réseau social @5 16`
C03	`08`	`X`	`ENG`	`@0 Social network @5 16`
C03	`08`	`X`	`SPA`	`@0 Red social @5 16`
N21				`@1 068`
N82				`@1 PSI`

Format Inist (serveur)

NO :	PASCAL 04-0108150 INIST
ET :	Parallel agent-based simulation on a cluster of workstations
AU :	POPOV (Konstantin); RAFEA (Mahmoud); HOLMGREN (Fredrik); BRAND (Per); VLASSOV (Vladimir); HARIDI (Self)
AF :	Distributed Systems Laboratory, SICS, Isafjordsgatan 22 Box 1263/16429 Kista/Suède (1 aut., 2 aut., 3 aut., 4 aut.); Department of Microelectronics and Information Technology, KTH, Isafjordsgatan 22 Electrum 229/16440 Kista/Suède (5 aut., 6 aut.)
DT :	Publication en série; Niveau analytique
SO :	Parallel processing letters; ISSN 0129-6264; Singapour; Da. 2003; Vol. 13; No. 4; Pp. 629-641; Bibl. 35 ref.
LA :	Anglais
EA :	We discuss a parallel implementation of an agent-based simulation. Our approach allows to adapt a sequential simulator for large-scale simulation on a cluster of workstations. We target discrete-time simulation models that capture the behavior of Web users and Web sites. Web users are connected with each other in a graph resembling the social network. Web sites are also connected in a similar graph. Users are stateful entities. At each time step, they exhibit certain behaviour such as visiting bookmarked sites, exchanging information about Web sites in the "word-of-mouth" style, and updating bookmarks. The real-world phenomena of emerged aggregated behavior of the Internet population is studied. The system distributes data among workstations, which allows large-scale simulations infeasible on a stand-alone computer. The model properties cause traffic between workstations proportional to partition sizes. Network latency is hidden by concurrent simulation of multiple users. The system is implemented in Mozart that provides multithreading, dataflow variables, component-based software development, and network-transparency. Currently we can simulate up to 10⁶ Web users on 10⁴ Web sites using a cluster of 16 computers, which takes few seconds per simulation step, and for a problem of the same size, parallel simulation offers speedups between 11 and 14.
CC :	001D02B04
FD :	Système réparti; Parallélisme; Système multiagent; Simulation; Extensibilité; Réseau web; Comportement utilisateur; Réseau social
ED :	Distributed system; Parallelism; Multiagent system; Simulation; Scalability; World wide web; User behavior; Social network
SD :	Sistema repartido; Paralelismo; Sistema multiagente; Simulación; Estensibilidad; Red WWW; Comportamiento usuario; Red social
LO :	INIST-22960.354000116425020100
ID :	04-0108150

Links to Exploration step

Pascal:04-0108150

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Parallel agent-based simulation on a cluster of workstations</title>
<author><name sortKey="Popov, Konstantin" sort="Popov, Konstantin" uniqKey="Popov K" first="Konstantin" last="Popov">Konstantin Popov</name>
<affiliation><inist:fA14 i1="01"><s1>Distributed Systems Laboratory, SICS, Isafjordsgatan 22 Box 1263</s1>
<s2>16429 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Rafea, Mahmoud" sort="Rafea, Mahmoud" uniqKey="Rafea M" first="Mahmoud" last="Rafea">Mahmoud Rafea</name>
<affiliation><inist:fA14 i1="01"><s1>Distributed Systems Laboratory, SICS, Isafjordsgatan 22 Box 1263</s1>
<s2>16429 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Holmgren, Fredrik" sort="Holmgren, Fredrik" uniqKey="Holmgren F" first="Fredrik" last="Holmgren">Fredrik Holmgren</name>
<affiliation><inist:fA14 i1="01"><s1>Distributed Systems Laboratory, SICS, Isafjordsgatan 22 Box 1263</s1>
<s2>16429 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name>
<affiliation><inist:fA14 i1="01"><s1>Distributed Systems Laboratory, SICS, Isafjordsgatan 22 Box 1263</s1>
<s2>16429 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Vlassov, Vladimir" sort="Vlassov, Vladimir" uniqKey="Vlassov V" first="Vladimir" last="Vlassov">Vladimir Vlassov</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Microelectronics and Information Technology, KTH, Isafjordsgatan 22 Electrum 229</s1>
<s2>16440 Kista</s2>
<s3>SWE</s3>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Haridi, Self" sort="Haridi, Self" uniqKey="Haridi S" first="Self" last="Haridi">Self Haridi</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Microelectronics and Information Technology, KTH, Isafjordsgatan 22 Electrum 229</s1>
<s2>16440 Kista</s2>
<s3>SWE</s3>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0108150</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0108150 INIST</idno>
<idno type="RBID">Pascal:04-0108150</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000200</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Parallel agent-based simulation on a cluster of workstations</title>
<author><name sortKey="Popov, Konstantin" sort="Popov, Konstantin" uniqKey="Popov K" first="Konstantin" last="Popov">Konstantin Popov</name>
<affiliation><inist:fA14 i1="01"><s1>Distributed Systems Laboratory, SICS, Isafjordsgatan 22 Box 1263</s1>
<s2>16429 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Rafea, Mahmoud" sort="Rafea, Mahmoud" uniqKey="Rafea M" first="Mahmoud" last="Rafea">Mahmoud Rafea</name>
<affiliation><inist:fA14 i1="01"><s1>Distributed Systems Laboratory, SICS, Isafjordsgatan 22 Box 1263</s1>
<s2>16429 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Holmgren, Fredrik" sort="Holmgren, Fredrik" uniqKey="Holmgren F" first="Fredrik" last="Holmgren">Fredrik Holmgren</name>
<affiliation><inist:fA14 i1="01"><s1>Distributed Systems Laboratory, SICS, Isafjordsgatan 22 Box 1263</s1>
<s2>16429 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name>
<affiliation><inist:fA14 i1="01"><s1>Distributed Systems Laboratory, SICS, Isafjordsgatan 22 Box 1263</s1>
<s2>16429 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Vlassov, Vladimir" sort="Vlassov, Vladimir" uniqKey="Vlassov V" first="Vladimir" last="Vlassov">Vladimir Vlassov</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Microelectronics and Information Technology, KTH, Isafjordsgatan 22 Electrum 229</s1>
<s2>16440 Kista</s2>
<s3>SWE</s3>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Haridi, Self" sort="Haridi, Self" uniqKey="Haridi S" first="Self" last="Haridi">Self Haridi</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Microelectronics and Information Technology, KTH, Isafjordsgatan 22 Electrum 229</s1>
<s2>16440 Kista</s2>
<s3>SWE</s3>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Parallel processing letters</title>
<title level="j" type="abbreviated">Parallel process. lett.</title>
<idno type="ISSN">0129-6264</idno>
<imprint><date when="2003">2003</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Parallel processing letters</title>
<title level="j" type="abbreviated">Parallel process. lett.</title>
<idno type="ISSN">0129-6264</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Distributed system</term>
<term>Multiagent system</term>
<term>Parallelism</term>
<term>Scalability</term>
<term>Simulation</term>
<term>Social network</term>
<term>User behavior</term>
<term>World wide web</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Système réparti</term>
<term>Parallélisme</term>
<term>Système multiagent</term>
<term>Simulation</term>
<term>Extensibilité</term>
<term>Réseau web</term>
<term>Comportement utilisateur</term>
<term>Réseau social</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We discuss a parallel implementation of an agent-based simulation. Our approach allows to adapt a sequential simulator for large-scale simulation on a cluster of workstations. We target discrete-time simulation models that capture the behavior of Web users and Web sites. Web users are connected with each other in a graph resembling the social network. Web sites are also connected in a similar graph. Users are stateful entities. At each time step, they exhibit certain behaviour such as visiting bookmarked sites, exchanging information about Web sites in the "word-of-mouth" style, and updating bookmarks. The real-world phenomena of emerged aggregated behavior of the Internet population is studied. The system distributes data among workstations, which allows large-scale simulations infeasible on a stand-alone computer. The model properties cause traffic between workstations proportional to partition sizes. Network latency is hidden by concurrent simulation of multiple users. The system is implemented in Mozart that provides multithreading, dataflow variables, component-based software development, and network-transparency. Currently we can simulate up to 10<sup>6</sup>
 Web users on 10<sup>4</sup>
 Web sites using a cluster of 16 computers, which takes few seconds per simulation step, and for a problem of the same size, parallel simulation offers speedups between 11 and 14.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0129-6264</s0>
</fA01>
<fA03 i2="1"><s0>Parallel process. lett.</s0>
</fA03>
<fA05><s2>13</s2>
</fA05>
<fA06><s2>4</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Parallel agent-based simulation on a cluster of workstations</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>POPOV (Konstantin)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>RAFEA (Mahmoud)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>HOLMGREN (Fredrik)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>BRAND (Per)</s1>
</fA11>
<fA11 i1="05" i2="1"><s1>VLASSOV (Vladimir)</s1>
</fA11>
<fA11 i1="06" i2="1"><s1>HARIDI (Self)</s1>
</fA11>
<fA14 i1="01"><s1>Distributed Systems Laboratory, SICS, Isafjordsgatan 22 Box 1263</s1>
<s2>16429 Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Department of Microelectronics and Information Technology, KTH, Isafjordsgatan 22 Electrum 229</s1>
<s2>16440 Kista</s2>
<s3>SWE</s3>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</fA14>
<fA20><s1>629-641</s1>
</fA20>
<fA21><s1>2003</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>22960</s2>
<s5>354000116425020100</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>35 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>04-0108150</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Parallel processing letters</s0>
</fA64>
<fA66 i1="01"><s0>SGP</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We discuss a parallel implementation of an agent-based simulation. Our approach allows to adapt a sequential simulator for large-scale simulation on a cluster of workstations. We target discrete-time simulation models that capture the behavior of Web users and Web sites. Web users are connected with each other in a graph resembling the social network. Web sites are also connected in a similar graph. Users are stateful entities. At each time step, they exhibit certain behaviour such as visiting bookmarked sites, exchanging information about Web sites in the "word-of-mouth" style, and updating bookmarks. The real-world phenomena of emerged aggregated behavior of the Internet population is studied. The system distributes data among workstations, which allows large-scale simulations infeasible on a stand-alone computer. The model properties cause traffic between workstations proportional to partition sizes. Network latency is hidden by concurrent simulation of multiple users. The system is implemented in Mozart that provides multithreading, dataflow variables, component-based software development, and network-transparency. Currently we can simulate up to 10<sup>6</sup>
 Web users on 10<sup>4</sup>
 Web sites using a cluster of 16 computers, which takes few seconds per simulation step, and for a problem of the same size, parallel simulation offers speedups between 11 and 14.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B04</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Système réparti</s0>
<s5>03</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Distributed system</s0>
<s5>03</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Sistema repartido</s0>
<s5>03</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Parallélisme</s0>
<s5>04</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Parallelism</s0>
<s5>04</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Paralelismo</s0>
<s5>04</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Système multiagent</s0>
<s5>05</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Multiagent system</s0>
<s5>05</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Sistema multiagente</s0>
<s5>05</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Simulation</s0>
<s5>06</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Simulation</s0>
<s5>06</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Simulación</s0>
<s5>06</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Extensibilité</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Scalability</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Estensibilidad</s0>
<s5>09</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Réseau web</s0>
<s5>13</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>World wide web</s0>
<s5>13</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Red WWW</s0>
<s5>13</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Comportement utilisateur</s0>
<s5>14</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>User behavior</s0>
<s5>14</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Comportamiento usuario</s0>
<s5>14</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Réseau social</s0>
<s5>16</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Social network</s0>
<s5>16</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Red social</s0>
<s5>16</s5>
</fC03>
<fN21><s1>068</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 04-0108150 INIST</NO>
<ET>Parallel agent-based simulation on a cluster of workstations</ET>
<AU>POPOV (Konstantin); RAFEA (Mahmoud); HOLMGREN (Fredrik); BRAND (Per); VLASSOV (Vladimir); HARIDI (Self)</AU>
<AF>Distributed Systems Laboratory, SICS, Isafjordsgatan 22 Box 1263/16429 Kista/Suède (1 aut., 2 aut., 3 aut., 4 aut.); Department of Microelectronics and Information Technology, KTH, Isafjordsgatan 22 Electrum 229/16440 Kista/Suède (5 aut., 6 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Parallel processing letters; ISSN 0129-6264; Singapour; Da. 2003; Vol. 13; No. 4; Pp. 629-641; Bibl. 35 ref.</SO>
<LA>Anglais</LA>
<EA>We discuss a parallel implementation of an agent-based simulation. Our approach allows to adapt a sequential simulator for large-scale simulation on a cluster of workstations. We target discrete-time simulation models that capture the behavior of Web users and Web sites. Web users are connected with each other in a graph resembling the social network. Web sites are also connected in a similar graph. Users are stateful entities. At each time step, they exhibit certain behaviour such as visiting bookmarked sites, exchanging information about Web sites in the "word-of-mouth" style, and updating bookmarks. The real-world phenomena of emerged aggregated behavior of the Internet population is studied. The system distributes data among workstations, which allows large-scale simulations infeasible on a stand-alone computer. The model properties cause traffic between workstations proportional to partition sizes. Network latency is hidden by concurrent simulation of multiple users. The system is implemented in Mozart that provides multithreading, dataflow variables, component-based software development, and network-transparency. Currently we can simulate up to 10<sup>6</sup>
 Web users on 10<sup>4</sup>
 Web sites using a cluster of 16 computers, which takes few seconds per simulation step, and for a problem of the same size, parallel simulation offers speedups between 11 and 14.</EA>
<CC>001D02B04</CC>
<FD>Système réparti; Parallélisme; Système multiagent; Simulation; Extensibilité; Réseau web; Comportement utilisateur; Réseau social</FD>
<ED>Distributed system; Parallelism; Multiagent system; Simulation; Scalability; World wide web; User behavior; Social network</ED>
<SD>Sistema repartido; Paralelismo; Sistema multiagente; Simulación; Estensibilidad; Red WWW; Comportamiento usuario; Red social</SD>
<LO>INIST-22960.354000116425020100</LO>
<ID>04-0108150</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000200 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000200 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Musique
   |area=    MozartV1
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:04-0108150
   |texte=   Parallel agent-based simulation on a cluster of workstations
}}

This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023

	Serveur d'exploration sur Mozart
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur Mozart

Parallel agent-based simulation on a cluster of workstations

Parallel agent-based simulation on a cluster of workstations

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri